Runtime Complexity (full) proof of /tmp/tmprsD5IE/secret1.xml

The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

0 CpxTRS

↳1 DecreasingLoopProof (⇔, 492 ms)

↳2 BOUNDS(n^1, INF)

↳3 RenamingProof (⇔, 0 ms)

↳4 CpxRelTRS

    ↳5 TypeInferenceProof (BOTH BOUNDS(ID, ID), 0 ms)

    ↳6 typed CpxTrs

    ↳7 OrderProof (LOWER BOUND(ID), 0 ms)

    ↳8 typed CpxTrs

    ↳9 RewriteLemmaProof (LOWER BOUND(ID), 403 ms)

    ↳10 BEST

        ↳11 typed CpxTrs

            ↳12 NoRewriteLemmaProof (LOWER BOUND(ID), 29 ms)

            ↳13 typed CpxTrs

            ↳14 LowerBoundsProof (⇔, 0 ms)

            ↳15 BOUNDS(n^1, INF)

        ↳16 typed CpxTrs

            ↳17 LowerBoundsProof (⇔, 0 ms)

            ↳18 BOUNDS(n^1, INF)

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

D(t) → s(h)
D(constant) → h
D(b(x, y)) → b(D(x), D(y))
D(c(x, y)) → b(c(y, D(x)), c(x, D(y)))
D(m(x, y)) → m(D(x), D(y))
D(opp(x)) → opp(D(x))
D(div(x, y)) → m(div(D(x), y), div(c(x, D(y)), pow(y, 2)))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → b(c(c(y, pow(x, m(y, 1))), D(x)), c(c(pow(x, y), ln(x)), D(y)))
b(h, x) → x
b(x, h) → x
b(s(x), s(y)) → s(s(b(x, y)))
b(b(x, y), z) → b(x, b(y, z))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
D(c(x, y)) →⁺ b(c(y, D(x)), c(x, D(y)))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0,1].
The pumping substitution is [x / c(x, y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

D(t) → s(h)
D(constant) → h
D(b(x, y)) → b(D(x), D(y))
D(c(x, y)) → b(c(y, D(x)), c(x, D(y)))
D(m(x, y)) → m(D(x), D(y))
D(opp(x)) → opp(D(x))
D(div(x, y)) → m(div(D(x), y), div(c(x, D(y)), pow(y, 2')))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → b(c(c(y, pow(x, m(y, 1'))), D(x)), c(c(pow(x, y), ln(x)), D(y)))
b(h, x) → x
b(x, h) → x
b(s(x), s(y)) → s(s(b(x, y)))
b(b(x, y), z) → b(x, b(y, z))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
D(t) → s(h)
D(constant) → h
D(b(x, y)) → b(D(x), D(y))
D(c(x, y)) → b(c(y, D(x)), c(x, D(y)))
D(m(x, y)) → m(D(x), D(y))
D(opp(x)) → opp(D(x))
D(div(x, y)) → m(div(D(x), y), div(c(x, D(y)), pow(y, 2')))
D(ln(x)) → div(D(x), x)
D(pow(x, y)) → b(c(c(y, pow(x, m(y, 1'))), D(x)), c(c(pow(x, y), ln(x)), D(y)))
b(h, x) → x
b(x, h) → x
b(s(x), s(y)) → s(s(b(x, y)))
b(b(x, y), z) → b(x, b(y, z))

Types:
D :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
t :: t:h:s:constant:c:m:opp:div:2':pow:ln:1'
s :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
h :: t:h:s:constant:c:m:opp:div:2':pow:ln:1'
constant :: t:h:s:constant:c:m:opp:div:2':pow:ln:1'
b :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
c :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
m :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
opp :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
div :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
pow :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
2' :: t:h:s:constant:c:m:opp:div:2':pow:ln:1'
ln :: t:h:s:constant:c:m:opp:div:2':pow:ln:1' → t:h:s:constant:c:m:opp:div:2':pow:ln:1'
1' :: t:h:s:constant:c:m:opp:div:2':pow:ln:1'
hole_t:h:s:constant:c:m:opp:div:2':pow:ln:1'1_0 :: t:h:s:constant:c:m:opp:div:2':pow:ln:1'
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0 :: Nat → t:h:s:constant:c:m:opp:div:2':pow:ln:1'

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
D, b

They will be analysed ascendingly in the following order:
b < D

(8) Obligation:

Generator Equations:
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(0) ⇔ t
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(x, 1)) ⇔ s(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(x))

The following defined symbols remain to be analysed:
b, D

They will be analysed ascendingly in the following order:
b < D

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0)), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Induction Base:
b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, 0)), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, 0)))

Induction Step:
b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, +(n4_0, 1))), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, +(n4_0, 1)))) →_R^Ω(1)
s(s(b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0)), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0))))) →_IH
s(s(*3_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

Lemmas:
b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0)), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(0) ⇔ t
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(x, 1)) ⇔ s(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(x))

The following defined symbols remain to be analysed:
D

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol D.

(13) Obligation:

Lemmas:
b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0)), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(0) ⇔ t
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(x, 1)) ⇔ s(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(x))

No more defined symbols left to analyse.

(14) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0)), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

(15) BOUNDS(n^1, INF)

(16) Obligation:

Lemmas:
b(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0)), gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(0) ⇔ t
gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(+(x, 1)) ⇔ s(gen_t:h:s:constant:c:m:opp:div:2':pow:ln:1'2_0(x))

No more defined symbols left to analyse.

(0) Obligation:

(1) DecreasingLoopProof (EQUIVALENT transformation)

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

(4) Obligation:

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

(6) Obligation:

(7) OrderProof (LOWER BOUND(ID) transformation)

(8) Obligation:

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

(10) Complex Obligation (BEST)

(11) Obligation:

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

(13) Obligation:

(14) LowerBoundsProof (EQUIVALENT transformation)

(15) BOUNDS(n^1, INF)

(16) Obligation:

(17) LowerBoundsProof (EQUIVALENT transformation)

(18) BOUNDS(n^1, INF)